Uniqueness of Smoothest Interpolants

نویسنده

  • Allan Pinkus
چکیده

(1) inf{‖f ‖p : f ∈ C [0, 1], f(ti) = ei, i = 1, . . . , m}, where ‖ · ‖p is the usual L [0, 1] norm, 1 ≤ p ≤ ∞, and to characterize f for which the above infimum is attained. If m ≤ n, then this problem has a simple solution. There are algebraic polynomials of degree at most n−1 satisfying the interpolation data, and any of these polynomials obviously solve our problem. If m > n then, in general, the above infimum is not attained within C[0, 1]. We are in the wrong space. For 1 < p ≤ ∞ we should be in W (n) p [0, 1], the standard Sobolev space of real-valued functions on [0, 1] with n − 1 absolutely continuous derivatives and nth derivative existing a.e. as a function in L[0, 1]. It is here that our solution is to be found. For p = 1 the situation is slightly more complicated, but known (see e.g., Fisher, Jerome [8], de Boor [5]). This extremal problem has played an important role in the development of spline theory. In the case p = 2 the unique solution of this extremal problem is a natural spline of degree 2n − 1 (with simple knots t1, . . . , tm). This oftquoted result, see de Boor [3], Schoenberg [18], was fundamental in the history of spline theory. For p = ∞ a solution (not necessarily unique) is a perfect spline of degree n with at most m − n − 1 knots, see Karlin [9], de Boor [4]. For p = 1 there is a solution which is a spline of degree n − 1 with at most m − n knots. In general, for 1 < p < ∞, this problem has a unique solution. It is attained by the unique function f satisfying f(ti) = ei, i = 1, . . . , m, whose nth derivative has the form

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Smoothest Interpolants *

This paper is concerned with the problem of characterizing those functions of minimum LP-norm on their nth derivative, <=p=<, that sequentially take on the given values (ei). For p = the unique minimizing function is characterized. For p < fairly explicit necessary conditions are given.

متن کامل

Interpolation by Loop ’ S Subdivision Functions

For the problem of constructing smooth functions over arbitrary surfaces from discrete data, we propose to use Loop’s subdivision functions as the interpolants. Results on the existence, uniqueness and error bound of the interpolants are established. An efficient progressive computation algorithm for the interpolants is also presented. Mathematics subject classification:

متن کامل

Topological criterion for selection of quintic Pythagorean-hodograph Hermite interpolants

A topological approach to identifying the “good” interpolant among the four distinct solutions to the first–order Hermite interpolation problem for planar quintic Pythagorean–hodograph curves is presented. An existence theorem is proved, together with a complete analysis of uniqueness/non– uniqueness properties. A simple formula for finding the “good” solution, without appealing to curve fairne...

متن کامل

Numerical integration using spline quasi-interpolants

In this paper, quadratic rules for obtaining approximate solution of definite integrals as well as single and double integrals using spline quasi-interpolants will be illustrated. The method is applied to a few test examples to illustrate the accuracy and the implementation of the method.

متن کامل

Algebraic properties of some new vector-valued rational interpolants

In a recent paper of the author [A. Sidi,A new approach to vector-valued rational interpolation, J.Approx. Theory, 130 (2004) 177–187], three new interpolation procedures for vector-valued functions F(z), where F : C → CN , were proposed, and some of their properties were studied. In this work, after modifying their definition slightly, we continue the study of these interpolation procedures. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004